منابع مشابه
An Intelligent Approach to Stock Cutting Optimization
The stock cutting problem has gained a lot of attention as a means to increase efficiency in many industrial sectors. In this paper, we present a multi-level, hierarchical, architecture exploiting different artificial intelligence methodologies for stock cutting optimization. An expert system is used at the highest level for decision functions; the second layer utilizes genetic algorithms for p...
متن کاملNonlinear cutting stock problem model to minimize the number of different patterns and objects
In this article we solve a nonlinear cutting stock problem which represents a cutting stock problem that considers the minimization of, both, the number of objects used and setup. We use a linearization of the nonlinear objective function to make possible the generation of good columns with the Gilmore and Gomory procedure. Each time a new column is added to the problem, we solve the original n...
متن کاملInteger Solutions to Cutting Stock Problems
We consider two integer linear programming models for the one-dimensional cutting stock problem that include various difficulties appearing in practical real problems. Our primary goals are the minimization of the trim loss or the minimization of the number of master rolls needed to satisfy the orders. In particular, we study an approach based on the classical column-generation procedure by Gil...
متن کاملCutting Stock by Iterated Matching
The combinatorial optimization problem considered in this paper is a special two dimen sional cutting stock problem arising in the wood metal and glass industry Given a demand of non oriented small rectangles and a theoretically in nite set of large stock rectangles of given lengths and widths the aim is to generate layouts with minimal waste specifying how to cut the demand out of the stock re...
متن کاملCutting plane oracles to minimize non-smooth non-convex functions
We discuss a bundle method for non-smooth non-convex optimization programs. In the absence of convexity, a substitute for the cutting plane mechanism has to be found. We propose such a mechanism and prove convergence of our method in the sense that every accumulation point of the sequence of serious iterates is critical.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1996
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00160-x